Chebyshev type lattice path weight polynomials by a constant term method

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chebyshev Type Lattice path weight polynomials by a constant term method

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary ‘decorated’ weights as well as an arbitrary ‘background’ weight. Our CT theorem, like Viennot’s lattice path theorem from which it is derived primarily by a change of variable lemma, is expressed in terms of orthogonal polynomials which in our appl...

متن کامل

The Carlitz lattice path polynomials

We study some polynomials of Carlitz as generating functions for some natural statistics on lattice paths with diagonals. c © 2000 Elsevier Science B.V. All rights reserved.

متن کامل

Curves Defined by Chebyshev Polynomials

Working over a field k of characteristic zero, this paper studies line embeddings of the form φ = (Ti, Tj , Tk) : A → A, where Tn denotes the degree n Chebyshev polynomial of the first kind. In Section 4, it is shown that (1) φ is an embedding if and only if the pairwise greatest common divisor of i, j, k is 1, and (2) for a fixed pair i, j of relatively prime positive integers, the embeddings ...

متن کامل

Adomian decomposition method with Chebyshev polynomials

In this paper an efficient modification of the Adomian decomposition method is presented by using Chebyshev polynomials. The proposed method can be applied to linear and non-linear models. The scheme is tested for some examples and the obtained results demonstrate reliability and efficiency of the proposed method. 2005 Elsevier Inc. All rights reserved.

متن کامل

Optimal Observer Path Planning For Bearings-Only Moving Targets Tracking Using Chebyshev Polynomials

In this paper, an optimization problem for the observer trajectory in the bearings-only surface moving target tracking (BOT) is studied. The BOT depends directly on the observability of the target's position in the target/observer geometry or the optimal observer maneuver. Therefore, the maximum lower band of the Fisher information matrix is opted as an independent criterion of the target estim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2009

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8113/42/44/445201